A Two Stage Algorithm for K-Mode Convolutive Nonnegative Tucker Decomposition
نویسندگان
چکیده
Higher order tensor model has been seen as a potential mathematical framework to manipulate the multiple factors underlying the observations. In this paper, we propose a flexible two stage algorithm for K-mode Convolutive Nonnegative Tucker Decomposition (K-CNTD) model by an alternating least square procedure. This model can be seen as a convolutive extension of Nonnegative Tucker Decomposition (NTD). Shift-invariant features in different subspaces can be extracted by the K-CNTD algorithm. We impose additional sparseness constraint on the algorithm to find the part-based representations. Extensive simulation results indicate that the K-CNTD algorithm is efficient and provides good performance for a feature extraction task.
منابع مشابه
Multifactor sparse feature extraction using Convolutive Nonnegative Tucker Decomposition
Multilinear algebra of the higher-order tensor has been proposed as a potential mathematical framework for machine learning to investigate the relationships among multiple factors underlying the observations. One popular model Nonnegative Tucker Decomposition (NTD) allows us to explore the interactions of different factors with nonnegative constraints. In order to reduce degeneracy problem of t...
متن کاملSome Theory on Non-negative Tucker Decomposition
Some theoretical difficulties that arise from dimensionality reduction for tensors with non-negative coefficients is discussed in this paper. A necessary and sufficient condition is derived for a low nonnegative rank tensor to admit a non-negative Tucker decomposition with a core of the same non-negative rank. Moreover, we provide evidence that the only algorithm operating mode-wise, minimizing...
متن کاملExtended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification
Analysis of high dimensional data in modern applications, such as neuroscience, text mining, spectral analysis or chemometrices naturally requires tensor decomposition methods. The Tucker decompositions allow us to extract hidden factors (component matrices) with a different dimension in each mode and investigate interactions among various modes. The Alternating Least Squares (ALS) algorithms h...
متن کاملAlgorithms for Sparse Nonnegative Tucker Decompositions
There is a increasing interest in analysis of large-scale multiway data. The concept of multiway data refers to arrays of data with more than two dimensions, that is, taking the form of tensors. To analyze such data, decomposition techniques are widely used. The two most common decompositions for tensors are the Tucker model and the more restricted PARAFAC model. Both models can be viewed as ge...
متن کاملTwo-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty
In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...
متن کامل